DP lower bounds for equivalence-checking and model-checking of one-counter automata

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

DP lower bounds for equivalence-checking and model-checking of one-counter automata

We present a general method for proving DP-hardness of problems related to formal verification of one-counter automata. For this we show a reduction of the SAT–UNSAT problem to the truth problem for a fragment of (Presburger) arithmetic. The fragment contains only special formulas with one free variable, and is particularly apt for transforming to simulation-like equivalences on one-counter aut...

متن کامل

Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds

We present a general method for proving DP-hardness of equivalencechecking problems on one-counter automata. For this we show a reduction of the SAT-UNSAT problem to the truth problem for a fragment of (Presburger) arithmetic. The fragment contains only special formulas with one free variable, and is particularly apt for transforming to simulation-like equivalences on one-counter automata. In t...

متن کامل

Model Checking Succinct and Parametric One-Counter Automata

We investigate the decidability and complexity of various model checking problems over one-counter automata. More specifically, we consider succinct one-counter automata, in which additive updates are encoded in binary, as well as parametric one-counter automata, in which additive updates may be given as unspecified parameters. We fully determine the complexity of model checking these automata ...

متن کامل

Branching-Time Model Checking of Parametric One-Counter Automata

We study the computational complexity of model checking EF logic and modal logic on parametric one-counter automata (POCA). A POCA is a onecounter automaton whose counter updates are either integer values encoded in binary or integer-valued parameters. Given a formula and a configuration of a POCA, the model-checking problem asks whether the formula is true in this configuration for all possibl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Computation

سال: 2004

ISSN: 0890-5401

DOI: 10.1016/s0890-5401(03)00171-8